package ZuoYe5_ShuZu_0423;

public class ZuoYe8_MaoPaoPaiXu {

	public static void main(String[] args) {
		// 8:baidu 冒泡排序算法的实现,快速排序算法的实现(代码背诵下来)
		// 冒泡排序算法
		int[] numbers = new int[] { 1, 5, 8, 2, 3, 9, 4 };
		int i, j;
		for (i = 0; i < numbers.length - 1; i++) {
			for (j = 0; j < numbers.length - 1 - i; j++) {
				if (numbers[j] > numbers[j + 1]) {
					int temp = numbers[j];
					numbers[j] = numbers[j + 1];
					numbers[j + 1] = temp;
				}
			}
		}
		System.out.println("从小到大排序后的结果是:");
		for (i = 0; i < numbers.length; i++)
			System.out.print(numbers[i] + " ");
		
	}

}
